193 research outputs found

    Generalizing email messages digests

    Full text link
    International audienceAn email digest is a message that results from the combination of other messages. Mailing list management systems implement digests to let subscribers reduce their email messages frequency. In this paper we address the issue of generalizing this digest technique for any message (i.e. not only issued from mailing lists). By generalizing we mean creating new message combinations while 1) keeping an email centric approach, and 2) generating a compact visualization to assist a user task. We implemented a preliminary prototype as a webmail and we will describe a series of digests providing users multiple visualizations in the context of a meeting planning by email

    Privacy-Aware Web Service Protocol Replaceability

    Get PDF
    ISBN: 0-7695-2924-0International audienceBusiness protocols are becoming a necessary part of Web services description. Many works investigate mechanisms for analyzing the compatibility and the substitution (i.e., replaceability) of Web services based on their functional properties. In this paper, we focus on the replaceability analysis. Whether a service can replace another depends not only on their functional properties but also on non functional requirements (e.g., privacy policies). We propose a privacy aware protocol replaceability approach to extend the earlier work of Web services replaceability by privacy properties. We introduce a rule-based privacy model and we extend business protocols, leading to what we call Private Business Protocols. Finally, a private replaceability analysis of private business protocols is discussed. We mainly investigate compatibility issues, that is whether one private business protocol can support the same set of conversations with respect to the privacy requirements

    Ontology development for the semantic web: an html form-based reverse engineering approach

    Get PDF
    The rapid growth of the Internet makes information available anywhere and anytime. Most businesses run Web-based front-end databases upon which online services are offered to end-users. The next generation of the Web, the semantic Web, seeks to offer data in a usable form for automatic reasoning. To this purpose, it is necessary to make existing database content ready-to-use for semantic Web applications, which use ontologies to formally define the semantics of their data. As a result, a large number of initiatives focus on building ontologies through automatic or semi-automatic processes. In this paper we present a semi-automatic reverse engineering approach that uses a relational database\u27s HTML forms and a set of transformation rules to produce to an OWL ontology

    Handling Conflicts in Depth-First Search for LTL Tableau to Debug Compliance Based Languages

    Full text link
    Providing adequate tools to tackle the problem of inconsistent compliance rules is a critical research topic. This problem is of paramount importance to achieve automatic support for early declarative design and to support evolution of rules in contract-based or service-based systems. In this paper we investigate the problem of extracting temporal unsatisfiable cores in order to detect the inconsistent part of a specification. We extend conflict-driven SAT-solver to provide a new conflict-driven depth-first-search solver for temporal logic. We use this solver to compute LTL unsatisfiable cores without re-exploring the history of the solver.Comment: In Proceedings FLACOS 2011, arXiv:1109.239

    Research response to coronavirus disease 2019 needed better coordination and collaboration: a living mapping of registered trials

    Get PDF
    Objectives: Researchers worldwide are actively engaging in research activities to search for preventive and therapeutic interventions against coronavirus disease 2019 (COVID-19). Our aim was to describe the planning of randomized controlled trials (RCTs) in terms of timing related to the course of the COVID-19 epidemic and research question evaluated. Study Design and Setting: We performed a living mapping of RCTs registered in the WHO International Clinical Trials Registry Platform. We systematically search the platform every week for all RCTs evaluating preventive interventions and treatments for COVID-19 and created a publicly available interactive mapping tool at https://covid-nma.com to visualize all trials registered. Results: By August 12, 2020, 1,568 trials for COVID-19 were registered worldwide. Overall, the median ([Q1–Q3]; range) delay between the first case recorded in each country and the first RCT registered was 47 days ([33–67]; 15–163). For the 9 countries with the highest number of trials registered, most trials were registered after the peak of the epidemic (from 100% trials in Italy to 38% in the United States). Most trials evaluated treatments (1,333 trials; 85%); only 223 (14%) evaluated preventive strategies and 12 postacute period intervention. A total of 254 trials were planned to assess different regimens of hydroxychloroquine with an expected sample size of 110,883 patients. Conclusion: This living mapping analysis showed that COVID-19 trials have relatively small sample size with certain redundancy in research questions. Most trials were registered when the first peak of the pandemic has passed

    Introduction : Special issue on web data integration

    No full text
    National audienc

    Representing and Reasoning on Conceptual Queries over Image Databases

    No full text
    The problem of content management of multimedia data types (e.g., image, video, graphics) is becoming increasingly important with the development of advanced multimedia applications. Traditional database management systems are inadequate for the handling of such data types. They require new techniques for query formulation, retrieval, evaluation, and navigation. In this paper we develop a knowledge-based framework for modeling and retrieving image data by content. To represent the various aspects of an image object's characteristics, we propose a model which consists of three layers: (1) Feature & Content Layer, intended to contain image visual features such as contours, shapes, etc.; (2) Object Layer, which provides the (conceptual) content dimension of images; and (3) Schema Layer, which contains the structured abstractions of images, i.e., a general schema about the classes of objects represented in the object layer. We propose two abstract languages on the basis of description logics: one for describing knowledge of the object and schema layers, and the other, more expressive, for making queries. Queries can refer to the form dimension (i.e., information of the Feature & Content Layer) or to the content dimension (i.e., information of the Object Layer). These languages employ a variable free notation. As the amount of information contained in the previous layers may be huge and operations performed at the Feature & Content Layer are time-consuming, resorting to the use of materialized views to process and optimize queries may be extremely useful. For that, we propose a formal framework for testing containment of a query in a view expressed in our query language
    corecore